Random, nonuniform distribution of line segments on a circle

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Random Line Segments in the Unit Square

I. INTRODUCTION Let Q = [0, 1] × [0, 1] denote the unit square and let L n be a set of n line segments in Q. Two line segments are said to be crossing if they intersect at any point. A subset of line segments is called non-crossing if no two segments in the subset are crossing. Consider the scenario where the endpoints of the n line segments are randomly distributed, independently and uniformly...

متن کامل

On Indexing Line Segments

In several image applications, it is necessary to retrieve specific line segments born a potentially very large set. In this paper, we consider the problem of indexing straight line segments to enable efficient retrieval of all line segments that (i) go through a specified point, or (ii) intersect a specified line segment. We propose a data organization, based on the Hough transform, that can b...

متن کامل

Random Fields of Segments and Random Mosaics on a Plane

The position ofan undirected segment of straight line of length r in a Euclidean plane is determined by the triple coordinate X = (x, y, (p), where x and y are the cartesian coordinates of the center of the segment and p is the angle made by the segment with the zero direction. Let X denote the phase space of segment coordinates, that is, the layer in the three dimensional Euclidean space defin...

متن کامل

Random walks of a quantum particle on a circle

When the quantum planar rotor is put on a lattice its dynamics can be approximated by random walks on a circle. This allows for fast and accurate Monte Carlo simulations to determine the topological charge of different configurations of the system and thereby the B dependence of the lowest energy levels.

متن کامل

On Computing Connected Components of Line Segments

It is shown that given a set of n line segments their connected components can be computed in time O n log n A bound of o n for this problem would imply a similar bound for detecting for a given set of n points and n lines whether some point lies on some of the lines This problem known as Hopcroft s problem is believed to have a lower bound of n For the special case when the endpoints of each s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Processes and their Applications

سال: 1984

ISSN: 0304-4149

DOI: 10.1016/0304-4149(84)90298-9